منابع مشابه
Query Based Client Indexing in Client/Server Information Systems
One issue in client/server information systems is the storage of the relationships between clients and data used by these clients. In particular in scenarios that allow the caching of data on the client site, this information can be used in order to keep the global database consistent. Thus, if the data on the server are updated, it is possible to detect caches affected by the update. In a foll...
متن کاملTowards Query Formulation, Query-Driven Ontology Extensions in OBDA Systems
The process of translating end-users’ information needs into executable and optimised queries over the data is the main problem that end-users face in Big Data scenarios. In this paper we present the recently started EU project Optique, which advocates for a next generation of the well known Ontology-Based Data Access (OBDA) approach to address this problem. We discuss challenges, present ongoi...
متن کاملQuery Rewriting Under Query Extensions for OWL 2 QL Ontologies
Conjunctive query answering is a key reasoning service for many ontology-based applications. With the advent of lightweight ontology languages, such as OWL 2 QL, several query answering systems have been proposed which compute the so called UCQ rewriting of a given query. It is often the case in realistic scenarios, that users refine their original queries, by e.g., extending them with new cons...
متن کاملExtensions to the GrETEL Treebank Query Application
In this paper we describe the extensions we made to an existing treebank query application (GrETEL). These extensions address user needs expressed by multiple linguistic researchers and include (1) facilities for uploading one’s own data and metadata in GrETEL; (2) conversion and cleaning modules for uploading data in the CHAT format; (3) new facilities for analysing the results of the treebank...
متن کاملA New Client-server Architecture for Distributed Query Processing a New Client-server Architecture for Distributed Query Processing
This paper presents the idea of \tuple bit-vectors" for distributed query processing. Using tuple bit-vectors, a new two-way semijoin operator called 2SJ++ that enhances the semijoin with an essentially \free" backward reduction capability is proposed. We explore in detail the beneets and costs of 2SJ++ compared with other semijoin variants, and its eeect on distributed query processing perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1999
ISSN: 0163-5808
DOI: 10.1145/304181.304213